Unifying the Linear Time-Branching Time Spectrum of Process Semantics

Unifying the Linear Time-Branching Time Spectrum of Process Semantics

Van Glabbeek’s linear time-branching time spectrum is one of the most relevant work on comparative study on process semantics, in which semantics are partially ordered by their discrimination power. In this paper we bring forward a refinement of this classification and show how the process semantics can be dealt with in a uniform way: based on the very natural concept of constrained simulation ...

Unifying the Linear Time-branching Time Spectrum of Strong Process Semantics

Van Glabbeek’s linear time-branching time spectrum is one of the most relevant work on comparative study on process semantics, in which semantics are partially ordered by their discrimination power. In this paper we bring forward a refinement of this classification and show how the process semantics can be dealt with in a uniform way: based on the very natural concept of constrained simulation ...

Towards Bialgebraic Semantics for the Linear Time - Branching Time Spectrum

Process algebra, e.g. CSP, offers different semantical observations (e.g. traces, failures, divergences) on a single syntactical system description. These observations are either computed algebraically from the process syntax, or “extracted” from a single operational model. Bialgebras capture both approaches in one framework and characterize their equivalence; however, due to use of finality, l...

The Quantitative Linear-Time--Branching-Time Spectrum

We present a distance-agnostic approach to quantitative verification. Taking as input an unspecified distance on system traces, or executions, we develop a game-based framework which allows us to define a spectrum of different interesting system distances corresponding to the given trace distance. Thus we extend the classic linear-time–branching-time spectrum to a quantitative setting, parametr...

The Linear Time-Branching Time Spectrum (Extended Abstract)